Uniform Nonextendability from Nets
نویسنده
چکیده
It is shown that there exist Banach spaces X,Y , a 1-net N of X and a Lipschitz function f : N → Y such that every F : X → Y that extends f is not uniformly continuous.
منابع مشابه
A Uniform Approach to Petri Nets
The new concept of parameterized net classes is introduced in order to allow a uniform presentation of diierent kinds of Petri net classes. By diierent actualizations of the net structure parameter and the data type parameter we obtain several well-known net classes, like elementary nets, place-transition nets, coloured Petri nets, pred-icate/transition nets, and algebraic high-level nets, as w...
متن کاملUniform Convergence of Discrete Curvatures from Nets of Curvature Lines
We study discrete curvatures computed from nets of curvature lines on a given smooth surface, and prove their uniform convergence to smooth principal curvatures. We provide explicit error bounds, with constants depending only on properties of the smooth limit surface and the shape regularity of the discrete net.
متن کاملUniform circuits, N Boolean proof nets
The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine the results taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boole...
متن کاملUniform Circuits, & Boolean Proof Nets
The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine this results by taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic B...
متن کاملA survey of proof nets and matrices for substructural logics
This paper is a survey of two kinds of “compressed” proof schemes, the matrix method and proof nets, as applied to a variety of logics ranging along the substructural hierarchy from classical all the way down to the nonassociative Lambek system. A novel treatment of proof nets for the latter is provided. Descriptions of proof nets and matrices are given in a uniform notation based on sequents, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015